* installing *source* package ‘SurfaceMesh’ ...
** this is package ‘SurfaceMesh’ version ‘0.1.2’
** package ‘SurfaceMesh’ successfully unpacked and MD5 sums checked
** using staged installation
** libs
specified C++17
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/SurfaceMesh/src'
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_alpha_wrap.cpp -o export_alpha_wrap.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_boolean.cpp -o export_boolean.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_bounding.cpp -o export_bounding.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_hausdorff.cpp -o export_hausdorff.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_mesh.cpp -o export_mesh.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_normals.cpp -o export_normals.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_read_write.cpp -o export_read_write.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_reconstruct.cpp -o export_reconstruct.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_remesh_acvd.cpp -o export_remesh_acvd.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_remesh_delaunay.cpp -o export_remesh_delaunay.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_remesh_isotropic.cpp -o export_remesh_isotropic.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_remesh_simplify.cpp -o export_remesh_simplify.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_remesh_smooth.cpp -o export_remesh_smooth.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_repair.cpp -o export_repair.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 export_subdivide.cpp -o export_subdivide.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 internal_cpptor.cpp -o internal_cpptor.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 internal_rtocpp.cpp -o internal_rtocpp.o
g++ -std=gnu++17 -I"/data/localhost/ripley/R/R-devel/include" -DNDEBUG -I'/data/localhost/ripley/R/test-dev/BH/include' -I'/data/localhost/ripley/R/test-dev/Rcpp/include' -I'/data/localhost/ripley/R/test-dev/RcppCGAL/include' -I'/data/localhost/ripley/R/test-dev/RcppEigen/include' -I/usr/local/include -DCGAL_HEADER_ONLY=1 -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 internal_utils.cpp -o internal_utils.o
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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_remesh_isotropic.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_bounding.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_mesh.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:21,
from export_remesh_isotropic.cpp:17:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_subdivide.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_read_write.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_remesh_acvd.cpp:7:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_remesh_simplify.cpp:7:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/bind/mem_fn.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bind/bind.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/ordered_index.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:37,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:43,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:61,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap.hpp:13,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:38:
/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)
| ^~~~~~~~
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_boolean.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_hausdorff.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from internal_rtocpp.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from internal_cpptor.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from internal_utils.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_normals.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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;
| ^~~~~~~~
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh_simplification/internal/Common.h:27,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh_simplification/edge_collapse.h:20,
from export_remesh_simplify.cpp:11:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:44,
from export_remesh_acvd.cpp:11:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_alpha_wrap.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_remesh_smooth.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_remesh_delaunay.cpp:7:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_reconstruct.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/or.hpp:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/type_traits.h:16,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/number_type_basic.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:28:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>]’
205 | 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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long unsigned int]’
205 | 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::ReadablePropertyMapConcept<boost::typed_identity_property_map<long unsigned int>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::typed_identity_property_map<long unsigned int>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
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/RcppCGAL/include/CGAL/property_map.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/internal/helpers.h:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/iterator.h:23,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO/3MF.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/IO.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Surface_mesh/Surface_mesh.h:20,
from SurfaceMesh.h:19,
from export_repair.cpp:14:
/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() ) )
| ^~~~~~~~
In file included from /usr/include/c++/16/bits/std_thread.h:45,
from /usr/include/c++/16/thread:47,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/config.h:428,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Cartesian/Cartesian_base.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Simple_cartesian.h:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Exact_predicates_inexact_constructions_kernel.h:20,
from SurfaceMesh.h:17:
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
from internal_cpptor.cpp:18:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
from internal_rtocpp.cpp:20:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 2 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:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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::readable_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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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))
| ^~~~~~~~~~~~~
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 /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/mst_orient_normals.h:41,
from export_normals.cpp:19:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/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<CGAL::SM_Halfedge_index> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<CGAL::SM_Halfedge_index>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from ‘struct boost::AssignableConcept<CGAL::SM_Halfedge_index>’
143 | BOOST_concept(Assignable,(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::AssignableConcept<CGAL::SM_Halfedge_index>]’
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::AssignableConcept<CGAL::SM_Halfedge_index> >::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::AssignableConcept<CGAL::SM_Halfedge_index> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<CGAL::SM_Halfedge_index>]’
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::AssignableConcept<CGAL::SM_Halfedge_index>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from ‘struct boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >::lazy_concept_checked’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:143:17: note: in a call to non-static member function ‘boost::AssignableConcept<CGAL::SM_Halfedge_index>::~AssignableConcept()’
143 | BOOST_concept(Assignable,(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:143:3: note: in expansion of macro ‘BOOST_concept’
143 | BOOST_concept(Assignable,(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::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from ‘struct boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from ‘struct boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]’
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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >::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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]’
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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from ‘struct boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >::lazy_concept_checked’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:349:17: note: in a call to non-static member function ‘boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>::~BinaryFunctionConcept()’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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:349:3: note: in expansion of macro ‘BOOST_concept’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~
/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<double> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from ‘struct boost::AssignableConcept<double>’
143 | BOOST_concept(Assignable,(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::AssignableConcept<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::AssignableConcept<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::AssignableConcept<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 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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::AssignableConcept<double>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:129:9: required from ‘struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:143:17: note: in a call to non-static member function ‘boost::AssignableConcept<double>::~AssignableConcept()’
143 | BOOST_concept(Assignable,(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:143:3: note: in expansion of macro ‘BOOST_concept’
143 | BOOST_concept(Assignable,(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::BinaryFunction<std::less<double>, bool, double, double> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from ‘struct boost::BinaryFunction<std::less<double>, bool, double, double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from ‘struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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::BinaryFunctionConcept<std::less<double>, bool, double, 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::BinaryFunctionConcept<std::less<double>, bool, double, 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::BinaryFunctionConcept<std::less<double>, bool, double, 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 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::BinaryFunction<std::less<double>, bool, double, 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::BinaryFunctionConcept<std::less<double>, bool, double, double>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:132:9: required from ‘struct boost::bimaps::multiset_of<double, std::less<double> >::lazy_concept_checked’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:349:17: note: in a call to non-static member function ‘boost::BinaryFunctionConcept<std::less<double>, bool, double, double>::~BinaryFunctionConcept()’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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:349:3: note: in expansion of macro ‘BOOST_concept’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bind/bind.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/ordered_index.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:37,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:43,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:61,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:37,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:24,
from export_remesh_delaunay.cpp:11:
/data/localhost/ripley/R/test-dev/BH/include/boost/get_pointer.hpp: At global scope:
/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)
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_criteria.h:26,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h:29,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_facet_criteria_3.h:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_criteria_3.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:25:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:357:49: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
357 | explicit reversible_ptr_container( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:383:51: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
383 | reversible_ptr_container& operator=( std::auto_ptr<PtrContainer> clone ) // nothrow
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:618:48: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
618 | iterator insert( iterator before, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:689:49: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
689 | auto_type replace( iterator where, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:717:48: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
717 | auto_type replace( size_type idx, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:223:45: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
223 | explicit ptr_sequence_adapter( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:242:47: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
242 | ptr_sequence_adapter& operator=( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:271:30: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
271 | void push_back( std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:294:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
294 | void push_front( std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:747:23: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
747 | explicit PC( std::auto_ptr<this_type> r ) \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO’
808 | BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:750:25: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
750 | PC& operator=( std::auto_ptr<this_type> r ) \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO’
808 | BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:775:10: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
775 | std::auto_ptr<this_type> release() \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:782:10: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
782 | std::auto_ptr<this_type> clone() const \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/ptr_vector.hpp: In member function ‘std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::release()’:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:777:12: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
777 | std::auto_ptr<this_type> ptr( new this_type );\
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/ptr_vector.hpp: In member function ‘std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::clone() const’:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:784:20: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
784 | return std::auto_ptr<this_type>( new this_type( this->begin(), this->end() ) ); \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>; Key = void*]’
147 | 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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 7 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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: [ skipping 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::Convertible<boost::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 3 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/detail/has_constraints.hpp:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator>]’:
/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 = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>::~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::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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 = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<CGAL::SM_Halfedge_index>]’:
/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<CGAL::SM_Halfedge_index> >]’
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<CGAL::SM_Halfedge_index>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from ‘struct boost::AssignableConcept<CGAL::SM_Halfedge_index>’
143 | BOOST_concept(Assignable,(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::AssignableConcept<CGAL::SM_Halfedge_index>]’
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::AssignableConcept<CGAL::SM_Halfedge_index> >::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 3 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/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = CGAL::SM_Halfedge_index]’
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::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]’:
/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::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from ‘struct boost::BinaryFunction<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from ‘struct boost::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index>]’
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::BinaryFunctionConcept<std::less<CGAL::SM_Halfedge_index>, bool, CGAL::SM_Halfedge_index, CGAL::SM_Halfedge_index> >::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 3 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/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:91:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
91 | >::type left_set_type;
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<CGAL::SM_Halfedge_index>; Return = bool; First = CGAL::SM_Halfedge_index; Second = CGAL::SM_Halfedge_index]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
351 | BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
| ^~~~~~~~~~~~~~~~~~~
/data/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<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<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<double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:143:3: required from ‘struct boost::AssignableConcept<double>’
143 | BOOST_concept(Assignable,(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::AssignableConcept<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::AssignableConcept<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 3 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/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = 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::BinaryFunction<std::less<double>, bool, double, 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::BinaryFunction<std::less<double>, bool, double, double> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: required from ‘struct boost::BinaryFunction<std::less<double>, bool, double, double>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:349:3: required from ‘struct boost::BinaryFunctionConcept<std::less<double>, bool, double, double>’
349 | BOOST_concept(BinaryFunction,(Func)(Return)(First)(Second))
| ^~~~~~~~~~~~~~
/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::BinaryFunctionConcept<std::less<double>, bool, double, 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::BinaryFunctionConcept<std::less<double>, bool, double, 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 3 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/bimap/detail/manage_bimap_key.hpp:70:13: required from ‘struct boost::bimaps::detail::manage_bimap_key<boost::bimaps::multiset_of<double, std::less<double> > >’
70 | >::type type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:97:13: required from ‘class boost::bimaps::detail::bimap_core<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
97 | >::type right_set_type;
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:133:7: required from ‘class boost::bimaps::bimap<boost::bimaps::set_of<CGAL::SM_Halfedge_index, std::less<CGAL::SM_Halfedge_index> >, boost::bimaps::multiset_of<double, std::less<double> >, mpl_::na, mpl_::na, mpl_::na>’
133 | class bimap
| ^~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/Isotropic_remeshing/remesh_impl.h:639:67: required from ‘void CGAL::Polygon_mesh_processing::internal::Incremental_remesher<PolygonMesh, VertexPointMap, GeomTraits, EdgeIsConstrainedMap, VertexIsConstrainedMap, FacePatchMap, FaceIndexMap>::collapse_short_edges(const SizingFunction&, bool) [with SizingFunction = CGAL::Polygon_mesh_processing::Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; VertexPointMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; GeomTraits = CGAL::Epick; EdgeIsConstrainedMap = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>; VertexIsConstrainedMap = CGAL::Static_boolean_property_map<CGAL::SM_Vertex_index, false>; FacePatchMap = CGAL::Polygon_mesh_processing::internal::Connected_components_pmap<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >, CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index> >; FaceIndexMap = CGAL::SM_index_pmap<CGAL::Point_3<CGAL::Epick>, CGAL::SM_Face_index>]’
639 | typedef typename Boost_bimap::value_type short_edge;
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/remesh.h:340:35: required from ‘void CGAL::Polygon_mesh_processing::isotropic_remeshing(const FaceRange&, SizingFunction&, PolygonMesh&, const NamedParameters&) [with PolygonMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; FaceRange = CGAL::Iterator_range<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Index_iterator<CGAL::SM_Face_index> >; SizingFunction = Uniform_sizing_field<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> > >; NamedParameters = CGAL::Named_function_parameters<CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Edge_index, bool>, CGAL::internal_np::edge_is_constrained_t, CGAL::Named_function_parameters<bool, CGAL::internal_np::protect_constraints_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_relaxation_steps_t, CGAL::Named_function_parameters<unsigned int, CGAL::internal_np::number_of_iterations_t, CGAL::internal_np::No_property> > > >; <template-parameter-1-5> = void]’
340 | remesher.collapse_short_edges(sizing, collapse_constraints);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_isotropic.cpp:69:29: required from here
69 | PMP::isotropic_remeshing(faces(mesh), sizing_field, mesh,
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
70 | CGAL::parameters::number_of_iterations(nIter)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
71 | .number_of_relaxation_steps(nRelaxSteps)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
72 | .protect_constraints(protectConstraints)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
73 | .edge_is_constrained_map(eif));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::BinaryFunction<Func, Return, First, Second>::~BinaryFunction() [with Func = std::less<double>; Return = bool; First = double; Second = double]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:351:7: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
351 | BOOST_CONCEPT_USAGE(BinaryFunction) { test(is_void<Return>()); }
| ^~~~~~~~~~~~~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/bind/mem_fn.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bind/bind.hpp:23,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/detail/ord_index_impl.hpp:82,
from /data/localhost/ripley/R/test-dev/BH/include/boost/multi_index/ordered_index.hpp:17,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/set_of.hpp:37,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/manage_bimap_key.hpp:26,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/detail/bimap_core.hpp:43,
from /data/localhost/ripley/R/test-dev/BH/include/boost/bimap/bimap.hpp:61,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_complex_3_in_triangulation_3.h:37,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:18,
from export_reconstruct.cpp:21:
/data/localhost/ripley/R/test-dev/BH/include/boost/get_pointer.hpp: At global scope:
/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)
| ^~~~~~~~
/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/scoped_ptr.hpp:13,
from /data/localhost/ripley/R/test-dev/BH/include/boost/graph/adjacency_list.hpp:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/split_graph_into_polylines.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Triangulation_2/internal/CTP2_subconstraint_graph.h:18,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Constrained_triangulation_plus_2.h:25,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Conforming_constrained_Delaunay_triangulation_3.h:38,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/make_conforming_constrained_Delaunay_triangulation_3.h:17,
from export_repair.cpp:17:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/or.hpp:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/type_traits.h:16,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/number_type_basic.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:28:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>]’
205 | 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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long unsigned int]’
205 | 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::ReadablePropertyMapConcept<boost::typed_identity_property_map<long unsigned int>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::typed_identity_property_map<long unsigned int>; Key = long unsigned int]’
147 | void constraints() {
| ^~~~~~~~~~~
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 /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/split_graph_into_polylines.h:19,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polyhedral_mesh_domain_with_features_3.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/surface_Delaunay_remeshing.h:27:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long unsigned int, int> >, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::associative_property_map<std::map<long unsigned int, int> >; Key = long unsigned int]’
179 | void constraints() {
| ^~~~~~~~~~~
In file included from /data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_sequence_adapter.hpp:20,
from /data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:20,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_criteria.h:26,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_3/mesh_standard_facet_criteria.h:29,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_facet_criteria_3.h:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Mesh_criteria_3.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/poisson_surface_reconstruction.h:19:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:357:49: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
357 | explicit reversible_ptr_container( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:383:51: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
383 | reversible_ptr_container& operator=( std::auto_ptr<PtrContainer> clone ) // nothrow
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:618:48: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
618 | iterator insert( iterator before, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:689:49: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
689 | auto_type replace( iterator where, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:717:48: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
717 | auto_type replace( size_type idx, std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:223:45: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
223 | explicit ptr_sequence_adapter( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:242:47: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
242 | ptr_sequence_adapter& operator=( std::auto_ptr<PtrContainer> clone )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:271:30: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
271 | void push_back( std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/ptr_sequence_adapter.hpp:294:31: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
294 | void push_front( std::auto_ptr<U> x )
| ^~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:747:23: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
747 | explicit PC( std::auto_ptr<this_type> r ) \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO’
808 | BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:750:25: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
750 | PC& operator=( std::auto_ptr<this_type> r ) \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:808:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO’
808 | BOOST_PTR_CONTAINER_COPY_AND_ASSIGN_AUTO( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:775:10: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
775 | std::auto_ptr<this_type> release() \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/detail/reversible_ptr_container.hpp:782:10: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
782 | std::auto_ptr<this_type> clone() const \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/ptr_vector.hpp: In member function ‘std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::release()’:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:777:12: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
777 | std::auto_ptr<this_type> ptr( new this_type );\
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/ptr_container/ptr_vector.hpp: In member function ‘std::auto_ptr<boost::ptr_vector<T, CloneAllocator, Allocator> > boost::ptr_vector<T, CloneAllocator, Allocator>::clone() const’:
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:784:20: warning: ‘template<class> class std::auto_ptr’ is deprecated: use 'std::unique_ptr' instead [-Wdeprecated-declarations]
784 | return std::auto_ptr<this_type>( new this_type( this->begin(), this->end() ) ); \
| ^~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:810:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_RELEASE_AND_CLONE’
810 | BOOST_PTR_CONTAINER_RELEASE_AND_CLONE( this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:840:4: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE’
840 | BOOST_PTR_CONTAINER_DEFINE_RELEASE_AND_CLONE( PC, base_type, this_type )
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/detail/reversible_ptr_container.hpp:843:5: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS’
843 | BOOST_PTR_CONTAINER_DEFINE_NON_INHERITED_MEMBERS( PC, base_type, this_type ) \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/ptr_container/ptr_vector.hpp:64:9: note: in expansion of macro ‘BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS’
64 | BOOST_PTR_CONTAINER_DEFINE_SEQEUENCE_MEMBERS( ptr_vector,
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/concept/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:20:5: note: in a call to non-static member function ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag>]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>]’
179 | 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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 2 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:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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::readable_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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::concepts::IncidenceGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 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/concept/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 4 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::WritablePropertyMapConcept<boost::associative_property_map<std::map<long unsigned int, 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::associative_property_map<std::map<long unsigned int, int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::Convertible<boost::lvalue_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::lvalue_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::associative_property_map<std::map<long unsigned int, 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::associative_property_map<std::map<long unsigned int, 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::associative_property_map<std::map<long unsigned int, 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::associative_property_map<std::map<long unsigned int, 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::associative_property_map<std::map<long unsigned int, int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Comparable<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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)
| ^~~~~~~~~~~~~~~~~~~
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/or.hpp:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/type_traits.h:16,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/number_type_basic.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:28:
/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::lvalue_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::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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::concepts::Graph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>; Key = void*]’
147 | 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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 7 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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: [ skipping 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::Convertible<boost::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 3 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/detail/has_constraints.hpp:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator>]’:
/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 = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>::~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::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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 = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
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<std::_List_iterator<void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::adj_list_dir_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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 5 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/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::WritablePropertyMapConcept<boost::associative_property_map<std::map<long unsigned int, int> >, long unsigned int> >’
/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::associative_property_map<std::map<long unsigned int, int> >, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:76:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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) {
| ^~~~~~~~~~~~~~~~~~~
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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/or.hpp:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/type_traits.h:16,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/number_type_basic.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:28:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>]’
205 | 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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long unsigned int]’
205 | 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::ReadablePropertyMapConcept<boost::typed_identity_property_map<long unsigned int>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::typed_identity_property_map<long unsigned int>; Key = long unsigned int]’
147 | 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 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/concept/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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)
| ^~~~~~~~~~~~~~~~~~~
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 /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/selection.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/repair_degeneracies.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/internal/refine_impl.h:28,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/refine.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_hole.h:22,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/triangulate_faces.h:18,
from export_reconstruct.cpp:27:
/data/localhost/ripley/R/test-dev/BH/include/boost/smart_ptr/scoped_ptr.hpp: At global scope:
/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() )
| ^~~~~~~~
/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/concept/detail/general.hpp: In instantiation of ‘static void boost::concepts::constraint<Model>::failed() [with Model = boost::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:130:9: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/connected_components.hpp:15,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:45:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:39:10: note: in a call to non-static member function ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
39 | 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::WritablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; 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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; 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::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 2 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:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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::readable_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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >’
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::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >’
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::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:41:9: required from ‘void boost::DFSVisitorConcept<Visitor, Graph>::constraints() [with Visitor = boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
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::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’
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::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >::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::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >’
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::DFSVisitorConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >, boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:130:9: [ skipping 2 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >::~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::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> > >]’:
/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> >’
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> >’
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> >’
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> >]’
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> > >::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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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> >]’
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> > >]’:
/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> >’
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> >’
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> >]’
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> > >::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> > >’
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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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> >]’
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> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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> >::~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::ReadWritePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, 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/depth_first_search.hpp:134:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::shared_array_property_map<boost::default_color_type, 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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::EqualityComparable<boost::default_color_type> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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::ColorValueConcept<boost::default_color_type> >::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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::default_color_type>]’
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::DefaultConstructible<boost::default_color_type> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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::ColorValueConcept<boost::default_color_type> >::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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::default_color_type>]’
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::ColorValue<boost::default_color_type> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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::ColorValueConcept<boost::default_color_type> >::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::ColorValueConcept<boost::default_color_type> >’
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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::ColorValue<boost::default_color_type>]’
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::ColorValueConcept<boost::default_color_type>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:136:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:502:15: note: in a call to non-static member function ‘boost::concepts::ColorValueConcept<boost::default_color_type>::~ColorValueConcept()’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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:502:1: note: in expansion of macro ‘BOOST_concept’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~~~~
/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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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: [ 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/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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: [ 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/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 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/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: [ 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/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::Assignable<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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::CopyConstructible<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > > >]’
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::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >’
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::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >’
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::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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::CopyConstructibleConcept<boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, 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 9 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >]’
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::concepts::Graph<boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS> >]’:
/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> > >]’
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> >’
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> >’
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> >’
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> >]’
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 6 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’:
/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> > >]’
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> >’
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> >’
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> >]’
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> > >::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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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/depth_first_search.hpp:134:9: [ 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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/depth_first_search.hpp:134:9: [ 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::shared_array_property_map<boost::default_color_type, 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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::lvalue_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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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/depth_first_search.hpp:134:9: [ 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::EqualityComparable<boost::default_color_type>]’:
/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::default_color_type> >]’
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::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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 6 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::default_color_type]’
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::DefaultConstructible<boost::default_color_type>]’:
/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::default_color_type> >]’
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::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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 6 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::default_color_type]’
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::concepts::ColorValue<boost::default_color_type>]’:
/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::ColorValue<boost::default_color_type> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: required from ‘struct boost::concepts::ColorValue<boost::default_color_type>’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:502:1: required from ‘struct boost::concepts::ColorValueConcept<boost::default_color_type>’
502 | BOOST_concept(ColorValue, (C))
| ^~~~~~~~~~
/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::ColorValueConcept<boost::default_color_type>]’
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::ColorValueConcept<boost::default_color_type> >::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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::ColorValue<C>::~ColorValue() [with C = boost::default_color_type]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:505:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
505 | BOOST_CONCEPT_USAGE(ColorValue)
| ^~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 5 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: required from ‘void boost::depth_first_search(const VertexListGraph&, DFSVisitor, ColorMap, typename graph_traits<G>::vertex_descriptor) [with VertexListGraph = adjacency_list<vecS, vecS, undirectedS>; DFSVisitor = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; ColorMap = shared_array_property_map<default_color_type, vec_adj_list_vertex_id_map<no_property, long unsigned int> >; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:397:42: required from ‘void boost::graph::detail::depth_first_search_impl<Graph>::operator()(const Graph&, const ArgPack&) const [with ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<boost::graph::keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; Graph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>]’
397 | boost::depth_first_search(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~^~~
398 | arg_pack[_visitor | make_dfs_visitor(null_visitor())],
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
399 | boost::detail::make_color_map_from_arg_pack(g, arg_pack),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
400 | arg_pack[_root_vertex
| ~~~~~~~~~~~~~~~~~~~~~
401 | || boost::detail::get_default_starting_vertex_t<
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
402 | Graph >(g)]);
| ~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::readable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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::lvalue_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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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::shared_array_property_map<boost::default_color_type, 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 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<boost::lvalue_property_map_tag, boost::read_write_property_map_tag>]’:
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >::~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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, const double&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, boost::detail::edge_desc_impl<boost::directed_tag, void*>, const boost::detail::edge_desc_impl<boost::directed_tag, void*>&, void*, const boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_reverse_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::ReadWritePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
205 | 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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
205 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>, void*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, boost::vertex_index_t>; Key = void*]’
147 | 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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Convertible<boost::lvalue_property_map_tag, boost::writable_property_map_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 7 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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: [ skipping 2 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:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 3 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/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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::Convertible<boost::readable_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::readable_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::readable_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::readable_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::readable_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::readable_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 3 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/detail/has_constraints.hpp:32:62: required 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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<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::typed_identity_property_map<long unsigned int>, long unsigned int>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::readable_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>]’
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<std::_Bit_iterator>]’:
/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 = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator>::~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::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:543:7: required from ‘struct boost::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::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 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::concepts::usage_requirements<boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:571:7: required from ‘struct boost::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::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>]’
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> >]’
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> > >]’
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> >’
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> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 8 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:253:5: required from ‘struct boost::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<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 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:601:7: required from ‘struct boost::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::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>]’
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> >]’
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> > >]’
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> >’
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> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 8 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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 = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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::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 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/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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>]’
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> >]’
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> > >]’
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> >’
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> >’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 8 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 6 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 15 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::lvalue_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::DefaultConstructible<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
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<std::_List_iterator<void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
/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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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: 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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:37:7: note: in a call to non-static member function ‘boost::InputIterator<TT>::~InputIterator() [with TT = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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<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 14 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >]’
20 | ~usage_requirements() { ((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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 7 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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>]’
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> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:129:9: required from ‘void boost::detail::depth_first_visit_impl(const IncidenceGraph&, typename boost::graph_traits<G>::vertex_descriptor, DFSVisitor&, ColorMap, TerminatorFunc) [with IncidenceGraph = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; DFSVisitor = components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > >; ColorMap = boost::shared_array_property_map<boost::default_color_type, boost::vec_adj_list_vertex_id_map<boost::no_property, long unsigned int> >; TerminatorFunc = nontruth2; typename boost::graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:286:39: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
286 | detail::depth_first_visit_impl(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
287 | g, start_vertex, vis, color, detail::nontruth2());
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::InputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::forward_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::forward_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::forward_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::forward_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::forward_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::forward_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 2 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/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::forward_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::forward_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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::forward_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<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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 9 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 9 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::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 = 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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::no_property> >, boost::no_property>*, std::vector<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property>, std::allocator<boost::detail::stored_edge_iter<long unsigned int, std::_List_iterator<boost::list_edge<long unsigned int, boost::no_property> >, boost::no_property> > > >, 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>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:75:1: [ skipping 4 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 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/depth_first_search.hpp:406:5: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type boost::graph::depth_first_search_with_named_params(const Param0&, const ArgPack&) [with Param0 = boost::adjacency_list<boost::vecS, boost::vecS, boost::undirectedS>; ArgPack = boost::parameter::aux::arg_list<boost::parameter::aux::tagged_argument<keywords::tag::visitor, const boost::detail::components_recorder<boost::associative_property_map<std::map<long unsigned int, int> > > >, boost::parameter::aux::empty_arg_list, std::integral_constant<bool, true> >; typename boost::result_of<detail::depth_first_search_impl<Param0>(Param0, const ArgPack&)>::type = void]’
680 | return detail::BOOST_PP_CAT( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
681 | name, _impl)< BOOST_PP_ENUM_PARAMS(nfixed, Param) >()( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~
682 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
683 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/depth_first_search.hpp:409:1: required from ‘typename boost::result_of<boost::graph::detail::depth_first_search_impl<Param0>(Param0, const typename boost::detail::convert_bgl_params_to_boost_parameter<boost::bgl_named_params<T, Tag, Base> >::type&)>::type boost::depth_first_search(const Param0&, const bgl_named_params<T, Tag, Base>&) [with Param0 = adjacency_list<vecS, vecS, undirectedS>; P = detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > >; T = graph_visitor_t; R = no_property; typename result_of<graph::detail::depth_first_search_impl<Param0>(Param0, const typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type&)>::type = void; typename detail::convert_bgl_params_to_boost_parameter<bgl_named_params<T, Tag, Base> >::type = parameter::aux::arg_list<parameter::aux::tagged_argument<graph::keywords::tag::visitor, const detail::components_recorder<associative_property_map<std::map<long unsigned int, int> > > >, parameter::aux::empty_arg_list, std::integral_constant<bool, true> >]’
730 | return ::boost::graph::BOOST_PP_CAT(name, _with_named_params)( \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~
731 | BOOST_PP_ENUM_PARAMS(nfixed, param) BOOST_PP_COMMA_IF(nfixed) \
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
732 | arg_pack); \
| ~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/connected_components.hpp:106:23: required from ‘typename boost::property_traits<IndexMap>::value_type boost::connected_components(const Graph&, ComponentMap, typename enable_if_c<is_base_and_derived<vertex_list_graph_tag, typename graph_traits<G>::traversal_category>::value, graph::detail::no_parameter>::type) [with Graph = adjacency_list<vecS, vecS, undirectedS>; ComponentMap = associative_property_map<std::map<long unsigned int, int> >; typename property_traits<IndexMap>::value_type = 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]’
106 | depth_first_search(g, visitor(vis));
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1243:38: required from ‘std::pair<std::vector<typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3>, std::vector<std::array<long unsigned int, 3> > > CGAL::Polygon_mesh_processing::internal::acvd_impl(TriangleMesh&, int, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; typename CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type::Point_3 = CGAL::Point_3<CGAL::Epick>; class CGAL::GetGeomTraits<PolygonMesh, NamedParameters>::type = CGAL::Epick]’
1243 | if (boost::connected_components(graph, boost::make_assoc_property_map(the_map)) > 1)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/approximated_centroidal_Voronoi_diagram_remeshing.h:1406:32: required from ‘bool CGAL::Polygon_mesh_processing::approximated_centroidal_Voronoi_diagram_remeshing(TriangleMesh&, std::size_t, const NamedParameters&) [with TriangleMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; NamedParameters = CGAL::Named_function_parameters<double, CGAL::internal_np::vertex_count_ratio_t, CGAL::internal_np::No_property>; std::size_t = long unsigned int]’
1406 | auto ps = internal::acvd_impl(tmesh, static_cast<int>(nb_vertices), np);
| ~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_remesh_acvd.cpp:44:63: required from here
44 | PMP::approximated_centroidal_Voronoi_diagram_remeshing(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^
45 | mesh, nb_clusters,
| ~~~~~~~~~~~~~~~~~~
46 | CGAL::parameters::vertex_count_ratio(vert_count_ratio));
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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) {
| ^~~~~~~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
182 | BOOST_CONCEPT_USAGE(VertexListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
37 | ~model()
| ^
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: note: in expansion of macro ‘BOOST_CONCEPT_USAGE’
233 | BOOST_CONCEPT_USAGE(EdgeListGraph)
| ^~~~~~~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >::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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::IncidenceGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::constraint<Model>::failed() [with Model = boost::ReadablePropertyMapConcept<boost::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >::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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> > >’
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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>, boost::detail::edge_desc_impl<boost::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_property_map<boost::directed_tag, double, double&, void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > >, boost::edge_residual_capacity_t>; Key = boost::detail::edge_desc_impl<boost::directed_tag, void*>]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::detail::edge_desc_impl<boost::directed_tag, void*>, boost::detail::edge_desc_impl<boost::directed_tag, void*>&, boost::vertex_predecessor_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::default_color_type, boost::default_color_type&, boost::vertex_color_t>; Key = void*]’
179 | 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::ReadablePropertyMapConcept<boost::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’:
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>]’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >::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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*> >’
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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>, void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_vertex_property_map<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, double, double&, boost::vertex_distance_t>; Key = void*]’
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::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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 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/concept/detail/has_constraints.hpp:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 2 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<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::concepts::MultiPassInputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned 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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<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::DefaultConstructible<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<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::EqualityComparable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<long unsigned int, 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::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<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::Assignable<boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_descriptor<long unsigned int, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Convertible<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, 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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category, boost::incidence_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>::traversal_category; 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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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::lvalue_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 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/concept/detail/has_constraints.hpp:32:62: required 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::lvalue_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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
502 | BOOST_concept(InputIterator,(TT))
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:540:3: required from ‘struct boost::ForwardIterator<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
540 | BOOST_concept(ForwardIterator,(TT))
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:568:3: required from ‘struct boost::BidirectionalIterator<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
568 | BOOST_concept(BidirectionalIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIterator<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
597 | BOOST_concept(RandomAccessIterator,(TT))
| ^~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:597:3: required from ‘struct boost::RandomAccessIteratorConcept<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’:
/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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >::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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<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::ForwardIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::BidirectionalIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::Comparable<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >’
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<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIterator<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<long 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<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<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::RandomAccessIteratorConcept<__gnu_cxx::__normal_iterator<long int*, std::vector<long int> > >)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = __gnu_cxx::__normal_iterator<long int*, std::vector<long int> >; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = long int; typename std::iterator_traits<_Iterator>::reference = long int&]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:115:41: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
115 | make_iterator_property_map(m_time_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<long int*, std::vector<long 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::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
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<std::_List_iterator<void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::adj_list_dir_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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
20 | ~usage_requirements() { ((Model*)0)->~Model(); }
| ^
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::CopyConstructible<long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<long unsigned int*>’
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<long unsigned int*>’
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<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::CopyConstructible<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<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::concepts::usage_requirements<boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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<long unsigned int*>’
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<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::range_detail::IncrementableIteratorConcept<long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<long unsigned int*>’
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<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<long unsigned int*>)>’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<long unsigned int*>)>’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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::range_detail::SinglePassIteratorConcept<long unsigned int*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:280:9: required from ‘struct boost::SinglePassRangeConcept<std::array<long unsigned int, 3> >’
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<std::array<long unsigned int, 3> >]’
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<std::array<long unsigned int, 3> > >::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<std::array<long unsigned int, 3> > >’
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<std::array<long unsigned int, 3> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = long unsigned int*]’
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::CopyConstructible<const long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:167:5: required from ‘struct boost::CopyConstructible<const long unsigned int*>’
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 long unsigned int*>’
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 long unsigned int*>’
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 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::range_detail::SinglePassIteratorConcept<const 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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<const 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::range_detail::IncrementableIteratorConcept<const long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:138:13: required from ‘struct boost::range_detail::IncrementableIteratorConcept<const long unsigned int*>’
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 long unsigned int*>’
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 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 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<const long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<const long unsigned int*>’
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 long unsigned int*>’
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 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 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<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::range_detail::SinglePassIteratorConcept<const long unsigned int*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:160:13: required from ‘struct boost::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const long unsigned int*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:283:9: [ skipping 8 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 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::range_detail::SinglePassIteratorConcept<const long unsigned int*>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:283:9: required from ‘struct boost::SinglePassRangeConcept<std::array<long unsigned int, 3> >’
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<std::array<long unsigned int, 3> >]’
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<std::array<long unsigned int, 3> > >::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<std::array<long unsigned int, 3> > >’
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<std::array<long unsigned int, 3> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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 long unsigned int*]’
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::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::SinglePassRangeConcept<std::array<long unsigned int, 3> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/concepts.hpp:286:9: required from ‘struct boost::SinglePassRangeConcept<std::array<long unsigned int, 3> >’
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<std::array<long unsigned int, 3> >]’
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<std::array<long unsigned int, 3> > >::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<std::array<long unsigned int, 3> > >’
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<std::array<long unsigned int, 3> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<std::array<long unsigned int, 3> >]’
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<std::array<long unsigned int, 3> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/range/size.hpp:62:9: required from ‘typename boost::range_size<const SinglePassRange>::type boost::size(const SinglePassRange&) [with SinglePassRange = std::array<long unsigned int, 3>; typename range_size<const SinglePassRange>::type = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Polygon_mesh_processing/polygon_soup_to_polygon_mesh.h:211:39: required from ‘bool CGAL::Polygon_mesh_processing::is_polygon_soup_a_polygon_mesh(const PolygonRange&) [with PolygonRange = std::vector<std::array<long unsigned int, 3> >]’
211 | std::size_t nb_edges = boost::size(polygon);
| ~~~~~~~~~~~^~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:878:44: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_manifold_surface(OutputMesh&, OVPM) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
878 | if(!PMP::is_polygon_soup_a_polygon_mesh(faces))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = std::array<long unsigned int, 3>]’
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::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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Assignable<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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 4 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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 4 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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 4 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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 4 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 4 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 4 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::iterators::detail::iterator_category_with_traversal<std::input_iterator_tag, boost::iterators::forward_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::forward_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::forward_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::forward_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::forward_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::forward_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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::forward_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/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::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::bidirectional_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::bidirectional_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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’
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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::bidirectional_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::forward_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::forward_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::forward_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::forward_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::forward_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::forward_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 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::forward_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::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
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<std::_List_iterator<void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::Convertible<std::forward_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 = boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::forward_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::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:52:50: required from ‘struct boost::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::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 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::EqualityComparable<boost::detail::edge_desc_impl<boost::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::Assignable<boost::detail::edge_desc_impl<boost::directed_tag, void*> > >]’:
/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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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::directed_tag, void*> > >’
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::directed_tag, void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*> >]’
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::directed_tag, void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:208:5: required from ‘struct boost::Convertible<boost::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_graph_tag>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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/detail/general.hpp: In instantiation of ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::adj_list_dir_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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 7 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:32:62: required by substitution of ‘template<class Model> boost::concepts::detail::yes boost::concepts::detail::has_constraints_(Model*, wrap_constraints<Model, (& Model::constraints)>*) [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned int> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned int> >)>’
72 | struct requirement_<void(*)(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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >)>’
72 | struct requirement_<void(*)(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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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<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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::CopyConstructible<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::CopyConstructible<long unsigned int*> >]’
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<long unsigned int*>’
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<long unsigned int*>’
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<long unsigned int*>’
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<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 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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = long unsigned int*]’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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::range_detail::IncrementableIteratorConcept<long unsigned int*> >]’
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<long unsigned int*>’
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<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = long unsigned int*]’
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<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/range/concepts.hpp:149:16: required from ‘struct boost::range_detail::SinglePassIteratorConcept<long unsigned int*>’
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<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::range_detail::SinglePassIteratorConcept<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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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::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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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<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::range_detail::SinglePassIteratorConcept<long unsigned int*> >]’
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<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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::range_detail::SinglePassIteratorConcept<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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = long unsigned int*]’
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::CopyConstructible<const 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::CopyConstructible<const long unsigned int*> >]’
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 long unsigned int*>’
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 long unsigned int*>’
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 long unsigned int*>’
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 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 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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long unsigned int*]’
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::range_detail::IncrementableIteratorConcept<const 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::range_detail::IncrementableIteratorConcept<const long unsigned int*> >]’
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 long unsigned int*>’
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 long unsigned int*>’
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 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::range_detail::SinglePassIteratorConcept<const 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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long unsigned int*]’
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 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<const 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<const long unsigned int*>’
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 long unsigned int*>’
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 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::range_detail::SinglePassIteratorConcept<const 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 10 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const long unsigned int*> >]’
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 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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::range_detail::SinglePassIteratorConcept<const 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 9 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 long unsigned int*]’
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<std::array<long unsigned int, 3> >]’:
/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<std::array<long unsigned int, 3> > >]’
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<std::array<long unsigned int, 3> >’
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<std::array<long unsigned int, 3> >]’
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<std::array<long unsigned int, 3> > >::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<std::array<long unsigned int, 3> > >’
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/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:905:31: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::extract_surface(OutputMesh&, OVPM, bool) const [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; OVPM = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >::Property_map<CGAL::SM_Vertex_index, CGAL::Point_3<CGAL::Epick> >; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
905 | extract_manifold_surface(output_mesh, ovpm);
| ~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Alpha_wrap_3/internal/Alpha_wrap_3.h:388:20: required from ‘void CGAL::Alpha_wraps_3::internal::Alpha_wrapper_3<Oracle_, Triangulation_>::operator()(double, double, OutputMesh&, const InputNamedParameters&, const OutputNamedParameters&) [with OutputMesh = CGAL::Surface_mesh<CGAL::Point_3<CGAL::Epick> >; InputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; OutputNamedParameters = CGAL::Named_function_parameters<bool, CGAL::internal_np::all_default_t>; Oracle_ = CGAL::Alpha_wraps_3::internal::Point_set_oracle<CGAL::Epick, int>; Triangulation_ = CGAL::Default]’
388 | extract_surface(output_mesh, ovpm, !do_enforce_manifoldness);
| ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:360:21: required from ‘void CGAL::alpha_wrap_3(const PointRange&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&, const Named_function_parameters<T_O, Tag_O, Base_O>&, std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)>*) [with PointRange = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; T_I = bool; Tag_I = internal_np::all_default_t; Base_I = internal_np::No_property; T_O = bool; Tag_O = internal_np::all_default_t; Base_O = internal_np::No_property; std::enable_if_t<((bool)boost::has_range_const_iterator<T>::value)> = void]’
360 | alpha_wrap_builder(alpha, offset, alpha_wrap, in_np, out_np);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:372:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&, const Named_function_parameters<NP_T, NP_Tag, NP_Base>&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >; NP_T = bool; NP_Tag = internal_np::all_default_t; NP_Base = internal_np::No_property]’
372 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, in_np, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/alpha_wrap_3.h:381:22: required from ‘void CGAL::alpha_wrap_3(const Input&, double, double, OutputMesh&) [with Input = std::vector<Point_3<Epick> >; OutputMesh = Surface_mesh<Point_3<Epick> >]’
381 | return alpha_wrap_3(input, alpha, offset, alpha_wrap, CGAL::parameters::default_values());
| ~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
export_alpha_wrap.cpp:37:21: required from here
37 | CGAL::alpha_wrap_3(points, alpha, offset, mesh_wrap);
| ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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 = std::array<long unsigned int, 3>]’
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)
| ^~~~~~~~~~~~~~~~~~~
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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:66:5: required from ‘struct boost::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::concepts::Graph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:182:5: required from ‘struct boost::concepts::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
176 | BOOST_concept(VertexListGraph, (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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::VertexListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/or.hpp:24,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/type_traits.h:16,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/Algebraic_structure_traits.h:21,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/number_type_basic.h:36,
from /data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/basic.h:28:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:15: note: in a call to non-static member function ‘boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~VertexListGraphConcept()’
176 | BOOST_concept(VertexListGraph, (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:176:1: note: in expansion of macro ‘BOOST_concept’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:233:5: required from ‘struct boost::concepts::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘struct boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
226 | BOOST_concept(EdgeListGraph, (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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::EdgeListGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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:226:15: note: in a call to non-static member function ‘boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~EdgeListGraphConcept()’
226 | BOOST_concept(EdgeListGraph, (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:226:1: note: in expansion of macro ‘BOOST_concept’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:87:5: required from ‘struct boost::concepts::IncidenceGraph<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >::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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::IncidenceGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >::~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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:956:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:958:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>]’
205 | 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::ReadablePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:960:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = boost::detail::csr_edge_descriptor<long unsigned int, 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::ReadWritePropertyMapConcept<boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:962:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:964:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; Key = long unsigned int]’
205 | 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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:966:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; Key = long unsigned int]’
205 | 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::ReadablePropertyMapConcept<boost::typed_identity_property_map<long unsigned int>, long unsigned int>]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:968:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::typed_identity_property_map<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::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::usage_requirements<boost::DefaultConstructible<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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: [ 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/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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: [ 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/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 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/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: [ 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/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::Assignable<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::DefaultConstructible<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*>]’:
/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<void*> >]’
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<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
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<std::_List_iterator<void*> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:512:7: required from ‘struct boost::InputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::Assignable<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int> >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:53:35: [ skipping 2 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::forward_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::forward_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::forward_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::forward_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::forward_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::forward_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 2 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/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::forward_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::forward_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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::forward_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<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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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/usage.hpp: In instantiation of ‘boost::concepts::usage_requirements<Model>::~usage_requirements() [with Model = boost::Convertible<std::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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::bidirectional_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 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::bidirectional_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::forward_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::forward_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::forward_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::forward_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::forward_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::forward_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 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::forward_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<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 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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) {
| ^~~~~~~~~~~~~~~~~~~
/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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:137:5: required from ‘struct boost::DefaultConstructible<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:68: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:233:5: required from ‘struct boost::EqualityComparable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:69: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<void*> >]’:
/data/localhost/ripley/R/test-dev/BH/include/boost/concept_check.hpp:145:5: required from ‘struct boost::Assignable<void*>’
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<void*>]’
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<void*> >::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<void*> >’
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<void*>)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:70: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/concept/detail/has_constraints.hpp:45:51: required from ‘struct boost::concepts::not_satisfied<boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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<void*>]’
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<void*>]’:
/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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘struct boost::concepts::VertexListGraph<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >)>’
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = void*]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::Convertible<boost::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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::adj_list_dir_traversal_tag, boost::vertex_list_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: [ 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/graph/graph_concepts.hpp:185:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::vertex_list_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::concepts::MultiPassInputIterator<boost::detail::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:90:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:91:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::directed_tag, void*> >]’:
/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::directed_tag, void*> > >]’
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::directed_tag, void*> >’
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::directed_tag, void*> >]’
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::directed_tag, void*> > >::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/graph/graph_concepts.hpp:92:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::directed_tag, void*>]’
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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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::adj_list_dir_traversal_tag, boost::edge_list_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: [ 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/graph/graph_concepts.hpp:239:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_traversal_tag; Y = boost::edge_list_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::concepts::MultiPassInputIterator<boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 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/graph/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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::Convertible<boost::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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::adj_list_dir_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: [ 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/graph/graph_concepts.hpp:93:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_dir_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::Assignable<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::iterators::counting_iterator<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::iterators::counting_iterator<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<boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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::InputIterator<boost::iterators::counting_iterator<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 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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::iterators::counting_iterator<long unsigned 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::iterators::counting_iterator<long unsigned int> >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::iterators::counting_iterator<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::Assignable<boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
50 | static void failed() { ((Model*)0)->~Model(); }
| ~~~~~~~~~~~~~~~~~~~^~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’:
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > > >::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/graph/graph_concepts.hpp:53:35: required from ‘boost::concepts::MultiPassInputIterator<T>::~MultiPassInputIterator() [with T = boost::detail::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>]’
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::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::csr_out_edge_iterator<boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> >]’
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::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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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<std::_Bit_iterator> >]’
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<std::_Bit_iterator>’
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<std::_Bit_iterator>’
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<std::_Bit_iterator> >’
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<std::_Bit_iterator>)>’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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 = std::_Bit_iterator]’
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<std::_Bit_iterator>]’
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, typename std::iterator_traits<_Iterator>::value_type, typename std::iterator_traits<_Iterator>::reference> boost::make_iterator_property_map(RAIter, ID) [with RAIter = std::_Bit_iterator; ID = typed_identity_property_map<long unsigned int>; typename std::iterator_traits<_Iterator>::value_type = bool; typename std::iterator_traits<_Iterator>::reference = std::_Bit_iterator::reference]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:108:58: required from ‘boost::detail::bk_max_flow<Graph, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap>::bk_max_flow(Graph&, EdgeCapacityMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, vertex_descriptor, vertex_descriptor) [with Graph = boost::compressed_sparse_row_graph<boost::directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; EdgeCapacityMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, boost::detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, boost::default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, boost::default_color_type&>; DistanceMap = boost::transform_value_property_map<boost::detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, boost::iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, boost::typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = boost::typed_identity_property_map<long unsigned int>; vertex_descriptor = long unsigned int]’
108 | , m_in_active_list_map(make_iterator_property_map(
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^
109 | m_in_active_list_vec.begin(), m_index_map))
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:974:9: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = compressed_sparse_row_graph<directedS, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP>; CapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ResidualCapacityEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, double&>; ReverseEdgeMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP> > >, detail::csr_edge_index_map<long unsigned int, long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::EdgeP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; PredecessorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, detail::csr_edge_descriptor<long unsigned int, long unsigned int> CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, detail::csr_edge_descriptor<long unsigned int, long unsigned int>&>; ColorMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, default_color_type CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, default_color_type&>; DistanceMap = transform_value_property_map<detail::lookup_one_property_f<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, double CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP::*>, iterator_property_map<__gnu_cxx::__normal_iterator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP*, std::vector<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, std::allocator<CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP> > >, typed_identity_property_map<long unsigned int>, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP, CGAL::Alpha_expansion_boost_compressed_sparse_row_impl::VertexP&>, double&>; IndexMap = typed_identity_property_map<long unsigned int>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = long unsigned int]’
974 | algo(g, cap, res_cap, rev_map, pre_map, color, dist, idx, src, sink);
| ^~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:378:7: required from here
377 | return boost::boykov_kolmogorov_max_flow
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
378 | (graph,
| ^~~~~~~
379 | boost::get(&EdgeP::edge_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
380 | boost::get(&EdgeP::edge_residual_capacity, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
381 | boost::get(&EdgeP::edge_reverse, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
382 | boost::get(&VertexP::vertex_predecessor, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
383 | boost::get(&VertexP::vertex_color, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
384 | boost::get(&VertexP::vertex_distance_t, graph),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
385 | boost::get(boost::vertex_index,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
386 | graph), // this is not bundled, get it from graph (CRS provides one)
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
387 | 0, 1);
| ~~~~~
/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::Assignable<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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 4 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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 4 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/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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<std::_List_iterator<void*> >]’:
/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<std::_List_iterator<void*> > >]’
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<std::_List_iterator<void*> >’
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<std::_List_iterator<void*> >]’
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<std::_List_iterator<void*> > >::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<std::_List_iterator<void*> > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:184:9: required from ‘boost::concepts::VertexListGraph<G>::~VertexListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:176:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::VertexListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
176 | BOOST_concept(VertexListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:949:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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 = std::_List_iterator<void*>]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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 4 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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 4 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/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’:
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > >]’
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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >::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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >’
45 | typedef boost::integral_constant<bool, value> type;
| ^~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/concept/detail/general.hpp:72:8: [ skipping 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(Model)>
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:235:9: required from ‘boost::concepts::EdgeListGraph<G>::~EdgeListGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/graph_concepts.hpp:226:1: required from ‘static void boost::concepts::requirement<boost::concepts::failed************ Model::************>::failed() [with Model = boost::concepts::EdgeListGraphConcept<boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
226 | BOOST_concept(EdgeListGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:952:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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::adj_list_edge_iterator<std::_List_iterator<void*>, boost::detail::out_edge_iter<__gnu_cxx::__normal_iterator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, long int>, boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 4 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 4 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/graph_concepts.hpp:89:9: required from ‘boost::concepts::IncidenceGraph<G>::~IncidenceGraph() [with G = boost::adjacency_list<boost::vecS, boost::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; CapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; ResidualCapacityEdgeMap = adj_list_edge_property_map<directed_tag, double, double&, void*, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_residual_capacity_t>; ReverseEdgeMap = adj_list_edge_property_map<directed_tag, detail::edge_desc_impl<directed_tag, void*>, const detail::edge_desc_impl<directed_tag, void*>&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_reverse_t>; PredecessorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, detail::edge_desc_impl<directed_tag, void*>, detail::edge_desc_impl<directed_tag, void*>&, vertex_predecessor_t>; ColorMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, default_color_type, default_color_type&, vertex_color_t>; DistanceMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, double, double&, vertex_distance_t>; IndexMap = adj_list_vertex_property_map<adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >, long unsigned int, const long unsigned int&, vertex_index_t>; typename property_traits<IndexMap>::value_type = double; typename graph_traits<G>::vertex_descriptor = void*]’
92 | &::boost::concepts::requirement_<ModelFnPtr>::failed> \
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1038:38: required from ‘typename boost::detail::edge_capacity_value<Graph, P, T, R>::type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor, const bgl_named_params<T, Tag, Base>&) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; P = int; T = buffer_param_t; R = no_property; typename detail::edge_capacity_value<Graph, P, T, R>::type = double; typename graph_traits<G>::vertex_descriptor = void*]’
1038 | return boykov_kolmogorov_max_flow(g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~
1039 | choose_const_pmap(get_param(params, edge_capacity), g, edge_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1040 | choose_pmap(get_param(params, edge_residual_capacity), g,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1041 | edge_residual_capacity),
| ~~~~~~~~~~~~~~~~~~~~~~~~
1042 | choose_const_pmap(get_param(params, edge_reverse), g, edge_reverse),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1043 | choose_pmap(
| ~~~~~~~~~~~~
1044 | get_param(params, vertex_predecessor), g, vertex_predecessor),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1045 | choose_pmap(get_param(params, vertex_color), g, vertex_color),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1046 | choose_pmap(get_param(params, vertex_distance), g, vertex_distance),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1047 | choose_const_pmap(get_param(params, vertex_index), g, vertex_index),
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
1048 | src, sink);
| ~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:1062:38: required from ‘typename boost::property_traits<typename boost::property_map<Graph, boost::edge_capacity_t>::const_type>::value_type boost::boykov_kolmogorov_max_flow(Graph&, typename graph_traits<G>::vertex_descriptor, typename graph_traits<G>::vertex_descriptor) [with Graph = adjacency_list<vecS, listS, directedS, property<vertex_index_t, long unsigned int, property<vertex_color_t, default_color_type, property<vertex_distance_t, double, property<vertex_predecessor_t, detail::edge_desc_impl<directed_tag, void*> > > > >, property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > > >; typename property_traits<typename property_map<Graph, edge_capacity_t>::const_type>::value_type = double; typename property_map<Graph, edge_capacity_t>::const_type = adj_list_edge_property_map<directed_tag, double, const double&, void*, const property<edge_capacity_t, double, property<edge_residual_capacity_t, double, property<edge_reverse_t, detail::edge_desc_impl<directed_tag, void*> > > >, edge_capacity_t>; typename graph_traits<G>::vertex_descriptor = void*]’
1062 | return boykov_kolmogorov_max_flow(g, src, sink, params);
| ~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/RcppCGAL/include/CGAL/boost/graph/alpha_expansion_graphcut.h:248:45: required from here
248 | return boost::boykov_kolmogorov_max_flow(graph, cluster_source,
| ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
249 | cluster_sink);
| ~~~~~~~~~~~~~
/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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >*, std::vector<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, std::allocator<boost::detail::stored_edge_property<void*, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > > > >, void*, boost::detail::edge_desc_impl<boost::directed_tag, void*>, 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 3 instantiation contexts, use -ftemplate-backtrace-limit=0 to disable ]
72 | struct requirement_<void(*)(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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >]’
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::listS, boost::directedS, boost::property<boost::vertex_index_t, long unsigned int, boost::property<boost::vertex_color_t, boost::default_color_type, boost::property<boost::vertex_distance_t, double, boost::property<boost::vertex_predecessor_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > >, boost::property<boost::edge_capacity_t, double, boost::property<boost::edge_residual_capacity_t, double, boost::property<boost::edge_reverse_t, boost::detail::edge_desc_impl<boost::directed_tag, void*> > > > > >]’
75 | BOOST_concept(IncidenceGraph, (G)) : Graph< G >
| ^~~~~~~~~~~~~~
/data/localhost/ripley/R/test-dev/BH/include/boost/graph/boykov_kolmogorov_max_flow.hpp:953:5: required from ‘typename boost::property_traits<IndexMap>::value_type boost::boykov_kolmogorov_max_flow(Graph&, CapacityEdgeMap, ResidualCapacityEdgeMap, ReverseEdgeMap, PredecessorMap, ColorMap, DistanceMap, IndexMap, typename graph_traits<G>